Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(g(f(a), h(a, f(a)))) → f(h(g(f(a), a), g(f(a), f(a))))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(g(f(a), h(a, f(a)))) → f(h(g(f(a), a), g(f(a), f(a))))
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Precedence:
g2 > f1 > a
g2 > h2 > a
Status:
a: multiset
g2: [1,2]
f1: multiset
h2: multiset